Improved parallel QR method for large least squares problems involving Kronecker products
نویسندگان
چکیده
منابع مشابه
On condition numbers for Moore-Penrose inverse and linear least squares problem involving Kronecker products
1School of Mathematics and Statistics, Key Laboratory for Applied Statistics of MOE, Northeast Normal University, Chang Chun 130024, China 2School of Mathematical Sciences, Ocean University of China, Qingdao, 266100, China 3School of Mathematical Sciences and Shanghai Key Laboratory of Contemporary Applied Mathematics, Fudan University, Shanghai, 200433, China 4Department of Computing and Softw...
متن کاملLeast – Squares Method For Estimating Diffusion Coefficient
Abstract: Determination of the diffusion coefficient on the base of solution of a linear inverse problem of the parameter estimation using the Least-square method is presented in this research. For this propose a set of temperature measurements at a single sensor location inside the heat conducting body was considered. The corresponding direct problem was then solved by the application of the ...
متن کاملLEAST – SQUARES METHOD FOR ESTIMATING DIFFUSION COEFFICIENT
Determining the diffusion coefficient based on the solution of the linear inverse problem of the parameter estimation by using the Least-square method is presented. A set of temperature measurements at a single sensor location inside the heat conducting body is required. The corresponding direct problem will be solved by an application of the heat fundamental solution.
متن کاملA Coarse-Grained Parallel QR-Factorization Algorithm for Sparse Least Squares Problems
A sparse QR-factorization algorithm SPARQR for coarse-grained parallel computations is described. The coeecient matrix, which is assumed to be general sparse, is reordered in an attempt to bring as many zero elements in the lower left corner as possible. The reordered matrix is then partitioned into block rows, and Givens plane rotations are applied in each block-row. These are independent task...
متن کاملMIQR: A Multilevel Incomplete QR Preconditioner for Large Sparse Least-Squares Problems
This paper describes a Multilevel Incomplete QR (MIQR) factorization for solving large sparse least-squares problems. The algorithm builds the factorization by exploiting structural orthogonality in general sparse matrices. At any given step, the algorithm finds an independent set of columns, i.e., a set of columns that have orthogonal patterns. The other columns are then block orthogonalized a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1997
ISSN: 0377-0427
DOI: 10.1016/s0377-0427(96)00109-4